A Cohen-Lenstra phenomenon for elliptic curves
نویسندگان
چکیده
Given an elliptic curve E and a finite Abelian group G, we consider the problem of counting the number of primes p for which the group of points modulo p is isomorphic to G. Under a certain conjecture concerning the distribution of primes in short intervals, we obtain an asymptotic formula for this problem on average over a family of elliptic curves.
منابع مشابه
Finding Suitable Curves for the Elliptic Curve Method of Factorization
Using the parametrizations of Kubert, we show how to produce in nite families of elliptic curves which have prescribed nontrivial torsion over Q and rank at least one. These curves can be used to speed up the ECM factorization algorithm of Lenstra. We also brie y discuss curves with complex multiplication in this context.
متن کاملHeuristics for the Arithmetic of Elliptic Curves
This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Rains, Voight, and Wood. We discuss the theoretical evidence for the model, and we make predictions about elliptic curves based on corresponding theorems proved about the model. In particular, the model suggests that ...
متن کاملParametrizations for Families of ECM-Friendly Curves
We provide a new family of elliptic curves that results in a one to two percent performance improvement of the elliptic curve integer factorization method. The speedup is confirmed by extensive tests for factors ranging from 15 to 63 bits.
متن کاملMulti-Dimensional Montgomery Ladders for Elliptic Curves
Montgomery’s ladder algorithm for elliptic curve scalar multiplication uses only the xcoordinates of points. Avoiding calculation of the y-coordinates saves time for certain curves. Montgomery introduced his method to accelerate Lenstra’s elliptic curve method for integer factoring. Bernstein extended Montgomery’s ladder algorithm by computing integer combinations of two points, thus accelerati...
متن کاملEfficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF2r and E over IFp. Some current systems based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. London Math. Society
دوره 89 شماره
صفحات -
تاریخ انتشار 2014